Faber Polynomials for Rational Mapping Functions
ثبت نشده
چکیده
منابع مشابه
Faber Polynomials Corresponding to Rational Exterior Mapping Functions
Faber polynomials corresponding to rational exterior mapping functions of degree (m,m − 1) are studied. It is shown that these polynomials always satisfy an (m + 1)-term recurrence. For the special case m = 2, it is shown that the Faber polynomials can be expressed in terms of the classical Chebyshev polynomials of the first kind. In this case, explicit formulas for the Faber polynomials are de...
متن کاملCoefficient Estimates for a General Subclass of m-fold Symmetric Bi-univalent Functions by Using Faber Polynomials
In the present paper, we introduce a new subclass H∑m (λ,β)of the m-fold symmetric bi-univalent functions. Also, we find the estimates of the Taylor-Maclaurin initial coefficients |am+1| , |a2m+1| and general coefficients |amk+1| (k ≥ 2) for functions in this new subclass. The results presented in this paper would generalize and improve some recent works of several earlier authors.
متن کاملThe Faber Polynomials for Circular Sectors
The Faber polynomials for a region of the complex plane, which are of interest as a basis for polynomial approximation of analytic functions, are determined by a conformai mapping of the complement of that region to the complement of the unit disc. We derive this conformai mapping for a circular sector {;: \z\ < 1, |argz| < i/a}, where a > 1, and obtain a recurrence relation for the coefficient...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملThe hitting time subgroup, Lukasiewicz paths and Faber polynomials
This talk connects simple lattice path enumeration with a subgroup of the Riordan group, ordered trees, and the Faber polynomials from classical complex analysis. The main tools employed are matrix multiplication, generating functions and a few definitions from group theory and complex functions.
متن کامل